A new family of MRD codes in $\mathbb F_q^{2n\times2n}$ with right and middle nuclei $\mathbb F_{q^n}$
نویسندگان
چکیده
In this paper, we present a new family of maximum rank distance (MRD for short) codes in F q of minimum distance 2 ≤ d ≤ 2n. In particular, when d = 2n, we can show that the corresponding semifield is exactly a Hughes-Kleinfeld semifield. The middle and right nuclei of these MRD codes are both equal to Fqn . We also prove that the MRD codes of minimum distance 2 < d < 2n in this family are inequivalent to all known ones. The equivalence between any two members of this new family is also determined.
منابع مشابه
On Codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and present construction of formally self-dual codes over $R$. Further, we give bounds on the minimum distance of LCD codes over $\F_q$ and extend these to codes ove...
متن کاملSelf-Dual Codes better than the Gilbert-Varshamov bound
We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any nonprime field $\mathbb F_q$, with $q\geq 64$, except possibly $q=125$, there are self-dual codes better than the asymptotic Gilbert--Varshamov bound.
متن کاملExplicit factorization of $x^n-1\in \mathbb F_q[x]$
Let $\mathbb F_q$ be a finite field and $n$ a positive integer. In this article, we prove that, under some conditions on $q$ and $n$, the polynomial $x^n-1$ can be split into irreducible binomials $x^t-a$ and an explicit factorization into irreducible factors is given. Finally, weakening one of our hypothesis, we also obtain factors of the form $x^{2t}-ax^t+b$ and explicit splitting of $x^n-1$ ...
متن کاملSkew cyclic codes over $\mathbb{F}_{p}+u\mathbb{F}_{p}$
In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\mathbb{F}_{p}+u\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\theta ]$-submodules of $R_{n}=R[x;\theta ]/\langle x^{n}-1\rangle $. We find all generator polynomials for these codes and describe their minimal spanning sets. Moreover, an...
متن کاملA new family in the stable homotopy groups of spheres
Let $p$ be a prime number greater than three. In this paper, we prove the existence of a new family of homotopy elements in the stable homotopy groups of spheres $pi_{ast}(S)$ which is represented by $h_nh_mtilde{beta}_{s+2}in {rm Ext}_A^{s+4, q[p^n+p^m+(s+2)p+(s+1)]+s}(mathbb{Z}_p,mathbb{Z}_p)$ up to nonzero scalar in the Adams spectral sequence, where $ngeq m+2>5$, $0leq sExt}_A^{s+2,q[(s+2)p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1709.03908 شماره
صفحات -
تاریخ انتشار 2017